Using Delaunay triangulation and Voronoi tessellation to predict the toxicities of binary mixtures containing hormetic compound
نویسندگان
چکیده
Concentration addition (CA) was proposed as a reasonable default approach for the ecological risk assessment of chemical mixtures. However, CA cannot predict the toxicity of mixture at some effect zones if not all components have definite effective concentrations at the given effect, such as some compounds induce hormesis. In this paper, we developed a new method for the toxicity prediction of various types of binary mixtures, an interpolation method based on the Delaunay triangulation (DT) and Voronoi tessellation (VT) as well as the training set of direct equipartition ray design (EquRay) mixtures, simply IDVequ. At first, the EquRay was employed to design the basic concentration compositions of five binary mixture rays. The toxic effects of single components and mixture rays at different times and various concentrations were determined by the time-dependent microplate toxicity analysis. Secondly, the concentration-toxicity data of the pure components and various mixture rays were acted as a training set. The DT triangles and VT polygons were constructed by various vertices of concentrations in the training set. The toxicities of unknown mixtures were predicted by the linear interpolation and natural neighbor interpolation of vertices. The IDVequ successfully predicted the toxicities of various types of binary mixtures.
منابع مشابه
A Distributed Delaunay Triangulation Algorithm Based on Centroid Voronoi Tessellation for Wireless Sensor Networks
A wireless sensor network can be represented by a graph. While the network graph is extremely useful, it often exhibits undesired irregularity. Therefore, special treatment of the graph is required by a variety of network algorithms and protocols. In particular, many geometry-oriented algorithms depend on a type of subgraph called Delaunay triangulation. However, when location information is un...
متن کاملRiemannian computational geometry: Voronoi diagram delaunay-type triangulation in dually flat space
One of most famous theorems in computational geometry is the duality between Voronoi diagram and Delaunay triangulation in Euclidean space. This paper proposes an extension of that theorem to the Voronoi diagram and Delaunay-type triangulation in dually at space. In that space, the Voronoi diagram and the triangulation can be computed e ciently by using potential functions. We also propose high...
متن کاملAnisotropic Centroidal Voronoi Tessellations and Their Applications
In this paper, we introduce a novel definition of the anisotropic centroidal Voronoi tessellation (ACVT) corresponding to a given Riemann metric tensor. A directional distance function is used in the definition to simplify the computation. We provide algorithms to approximate the ACVT using the Lloyd iteration and the construction of anisotropic Delaunay triangulation under the given Riemannian...
متن کاملConforming Centroidal Voronoi Delaunay Triangulation for Quality Mesh Generation
As the methodology of centroidal Voronoi tessellation (CVT) is receiving more and more attention in the mesh generation community, a clear characterization of the influence of geometric constraints on the CVT-based meshing is becoming increasingly important. In this paper, we first give a precise definition of the geometrically conforming centroidal Voronoi Delaunay triangulation (CfCVDT) and t...
متن کاملImproved initialisation for centroidal Voronoi tessellation and optimal Delaunay triangulation
Centroidal Voronoi tessellations and optimal Delaunay triangulations can be approximated efficiently by non-linear optimisation algorithms. This paper demonstrates that the point distribution used to initialise the optimisation algorithms is important. Compared to conventional random initialisation, certain low-discrepancy point distributions help convergence towards more spatially regular resu...
متن کامل